Summary

• Restructured problem-def to separate formal definition from body — problem-def(name)[def][body] now has three parameters, with auto-generated sections (complexity table, reductions, schema) appearing between them
• Added example visualizations to all 21 problem definitions — concrete small instances with CetZ figures showing solutions on graphs (Petersen, house, path, K4, etc.), set diagrams, matrix grids, and car sequences
• Fixed algorithm citation style — replaced terse "Best known: O*(...)" appendages with natural prose naming algorithms and citing references; added footnote warnings for brute-force entries without specialized algorithms
• Added set diagram primitives to lib.typ — selem() for universe elements and sregion() for set regions (ellipse-based)
• Created write-model-in-paper and write-rule-in-paper skills — full authoring guides for paper entries
• Fixed 3 incorrect algorithm names — DomSet (branch-and-reduce → measure-and-conquer), Clique (O*(1.2109^n) → O*(1.1888^n) @Robson2001), ILP (lattice-based enumeration → FPT algorithm)

Test plan

• make paper compiles without errors
• Verify figures render correctly in PDF
• Cross-reference algorithm complexities against issue Complexity metadata correctness review: best-known algorithm complexities and reduction overheads #107

🤖 Generated with Claude Code